#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
vector<LL>v[maxn];
LL ans[maxn];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        LL n,k;cin>>n>>k;
        for(LL i=1;i<=n;i++) v[i].clear(),ans[i]=0;
        for(LL i=1;i<=n;i++){
            LL x;cin>>x;
            v[x].push_back(i);
        }
        vector<LL>e;
        for(LL i=1;i<=n;i++){
            if(v[i].size()>=k){
                for(LL j=0;j<k;j++){
                    ans[v[i][j]]=j+1;
                }
            }
            else{
                for(LL j=0;j<v[i].size();j++){
                    e.push_back(v[i][j]);
                }
            }
        }
        LL ave=e.size()/k;
        for(LL i=1;i<=ave;i++){
            for(LL j=0;j<k;j++){
                ans[e.back()]=j+1;
                e.pop_back();
            }
        }
        for(LL i=1;i<=n;i++){
            cout<<ans[i]<<" ";
        }cout<<"\n";
    }
   	return 0;
}
